High dimensional Apollonian networks
نویسندگان
چکیده
We propose a simple algorithm which produces high dimensional Apollonian networks with both small-world and scale-free characteristics. We derive analytical expressions for the degree distribution, the clustering coefficient and the diameter of the networks, which are determined by their dimension. PACS numbers: 89.75.Hc, 89.75.Da, 89.20.Hh High dimensional Apollonian networks 2
منابع مشابه
High dimensional random Apollonian networks
We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and clustering coefficients which are determined by the dimension of the network. The values obtained for these parameters are in good agreement with simulation resul...
متن کاملWheel Random Apollonian Graphs
In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic graph properties like vertices and edges cardinality, some question concerning cycles and the chromaticity in such type of graphs, we suggest further work on t...
متن کامل. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks
We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.
متن کاملApollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions
This paper gives n-dimensional analogues of the Apollonian circle packings in parts I and II. Those papers considered circle packings described in terms of their Descartes configurations, which are sets of four mutually touching circles. They studied packings that had integrality properties in terms of the curvatures and centers of the circles. Here we consider collections of n-dimensional Desc...
متن کاملMaximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs
The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apoll...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010